BSA: A Hybrid Bees’ Simulated Annealing Algorithm To Solve Optimization & NP-Complete Problems
نویسندگان
چکیده
Swarm-based algorithms such as Bees Algorithm BA have proven to be very powerful computational techniques due to their search capabilities. Other methods which are useful in diverse application areas are simulated annealing, evolution strategies etc. The searching ability of these algorithms can be improved by properly blending their characteristic features. In this paper an attempt is made to intermix the search properties of BA and SA, in order to develop a hybrid algorithm which is equally applicable and has a better searching ability and power to reach a near optimal solution. This leads to the development of a fast method to solve complicated types of optimization and NP-complete problems. عون نم لكاشمو ةيلثملاا لحل ةنيجهلا دلقملا نيدلتلا تاذ لحنلا ةيمزراوخ
منابع مشابه
A Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملA Novel Hybrid Whale Optimization Algorithm to Solve a Production-Distribution Network Problem Considering Carbon Emissions
Nowadays, there is a great deal of attention for regulations of carbon emissions to enforce the decision-makers of production and distribution networks to redesign their systems satisfactorily. The literature has seen a rapid interest in developing novel metaheuristics to solve this problem as a complicated optimization problem. Such difficulties motivate us to address a production-distribution...
متن کاملAddressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics
In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...
متن کامل